Thus w ( h ) = ( v ) = d ( v ) , a heaviest cycle and a heaviest v - longest path are simply a longest cycle and a y - longest path respectively . the implicit weighted degree ic is just implicit degree id ( v ) ( see e . g 此時叫丑)舊( i ,公… )一叭t )最重圈就是最長甩最重t )一最觸即t )一最柵,隱賦鵬偵扣)就是雕妹叫(參見網)
The first section of this paper gives a brief introduction about the basic concepts , terminology and symboles which are used in this paper . in section 2 , we give an accurate discussion about the structure of a kind of graphs in [ 6 ] and get the extremal graph . in the third section , we introduce a new concept - - - - implicit weighted degree and using it we give a condition on the existence of heavy cycles in weighted graphs 在本文的第一部分中,我們簡要介紹了論文中所涉及的一些概念,術語和符號;在第二部分中,我們對中圖的結構進行了精確的討論,給出了一個極圖;在第三部分,我們定義了一個新參數?隱賦權度,給出了賦權圖中重圈存在的隱賦權度條件;最后,在第四部分,我們給出了賦權圖中過兩點的重圈存在性的dirac型條件。